Multi-result Supercompilation as Branching Growth of the Penultimate Level in Metasystem Transitions
نویسندگان
چکیده
The paper deals with some aspects of metasystem transitions in the context of supercompilation. We consider the manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation and argue that this law provides some useful hints regarding the ways of constructing metasystems by combining supercompilers. In particular we show the usefulness of multi-result supercompilation for proving the equivalence of expressions and in two-level supercompilation.
منابع مشابه
Constructing Programs From Metasystem Transition Proofs
It has previously been shown by Turchin in the context of supercompilation how metasystem transitions can be used in the proof of universally and existentially quantified conjectures. Positive supercompilation is a variant of Turchin’s supercompilation which was introduced in an attempt to study and explain the essentials of Turchin’s supercompiler. In our own previous work, we have proposed a ...
متن کاملTowards Higher-Level Supercompilation
We show that the power of supercompilation can be increased by constructing a hierarchy of supercompilers, in which a lowerlevel supercompiler is used by a higher-level one for proving improvement lemmas. The lemmas thus obtained are used to transform expressions labeling nodes in process trees, in order to avoid premature generalizations. Such kind of supercompilation, based on a combination o...
متن کامل(Meta)Systems as Constraints on Variation—A classification and natural history of metasystem transitions
A new conceptual framework is proposed to situate and integrate the parallel theories of Turchin, Powers, Campbell and Simon. A system is defined as a constraint on variety. This entails a 2 × 2 × 2 classification scheme for “higher-order” systems, using the dimensions of constraint, (static) variety, and (dynamic) variation. The scheme distinguishes two classes of metasystems from supersystems...
متن کاملMetasystem Transitions in Computer Science and Mathematics
We analyze MSTs, which may be observed, or are intentionally organized, in computer science and mathematics. These sciences are considered dealing with linguistic modeling. Various metasystems structures are revealed in activities of using the computer as a tool that makes linguistic models behaving by themselves, independently of their creator. The crucial role in automation of creating lingui...
متن کاملFormalizing and Implementing Multi-Result Supercompilation
The paper explains the principles of multi-result supercompilation. We introduce a formalism for representing supercompilation algorithms as rewriting rules for graphs of configurations. Some low-level technical details related to the implementation of multi-result supercompilation in MRSC are discussed. In particular, we consider the advantages of using spaghetti stacks for representing graphs...
متن کامل